Gaussian quadrature for sums: A rapidly convergent summation scheme

نویسنده

  • H. Monien
چکیده

Gaussian quadrature is a well-known technique for numerical integration. Recently Gaussian quadrature with respect to discrete measures corresponding to finite sums has found some new interest. In this paper we apply these ideas to infinite sums in general and give an explicit construction for the weights and abscissae of Gaussian formulas. The abscissae of the Gaussian summation have a very interesting asymptotic distribution function with a kink singularity. We apply the Gaussian summation technique to two problems which have been discussed in the literature. We find that the Gaussian summation has a very rapid convergence rate for the Hardy-Littlewood sum for a large range of parameters.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Hardy-Littlewood Function An Exercise in Slowly Convergent Series

The function in question is H(x) = ∑∞ k=1 sin(x/k)/k. In deference to the general theme of this conference, a summation procedure is first described using orthogonal polynomials and polynomial/rational Gauss quadrature. Its effectiveness is limited to relatively small (positive) values of x. Direct summation with acceleration is shown to be more powerful for very large values of x. Such values ...

متن کامل

Computing sums of conditionally convergent and divergent series using the concept of grossone

Let a1, a2, . . . be a numerical sequence. In this talk we consider the classical problem of computing the sum ∑∞ n=1 an when the series is either conditionally convergent or divergent. We demonstrate that the concept of grossone, proposed by Ya. Sergeyev in [1], can be useful in both computing this sum and studying properties of summation methods. First we prove that within the grossone univer...

متن کامل

Fast evaluation of multiple zeta sums

We show that the multiple zeta sum: ζ(s1, s2, ..., sd) = ∑ n1>n2>...>nd 1 n1 1 n s2 2 ...n sd d , for positive integers si with s1 > 1, can always be written as a finite sum of products of rapidly convergent series. Perhaps surprisingly, one may develop fast summation algorithms of such efficiency that the overall complexity can be brought down essentially to that of one-dimensional summation. ...

متن کامل

Gaussian quadratures with respect to Discrete measures

In analogy to the subject of Gaussian integration formulas we present an overview of some Gaussian summation formulas. The derivation involve polynomials that are orthogonal under discrete inner products and the resulting formulas are useful as a numerical device for summing fairly general series. Several illuminating examples are provided in order to present various aspects of this not very we...

متن کامل

Strong Convergence of Weighted Sums for Negatively Orthant Dependent Random Variables

We discuss in this paper the strong convergence for weighted sums of negatively orthant dependent (NOD) random variables by generalized Gaussian techniques. As a corollary, a Cesaro law of large numbers of i.i.d. random variables is extended in NOD setting by generalized Gaussian techniques.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Math. Comput.

دوره 79  شماره 

صفحات  -

تاریخ انتشار 2010